Analysis of a linearly constrained least squares algorithm for adaptive beamforming
نویسندگان
چکیده
DTrj QUXIAJAT flSCFTED 3 The problem of linearly constrained least squares has many applications in signal processing. In this paper, we present a perturbation analysis of a linearly constrrined least squares algorithm for adaptive beaniforming. The perturbation bounds for the solution as well as for the alaest residual element are derived. We also propose an error estimation scheme for the residual element, which can be incorporated into a systolic array implementation of the algorithm.
منابع مشابه
Superlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis
We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...
متن کاملLow-Complexity Variable Forgetting Factor Constrained Constant Modulus RLS Algorithm for Adaptive Beamforming
In this paper, a recursive least squares (RLS) based blind adaptive beamforming algorithm that features a new variable forgetting factor (VFF) mechanism is presented. The beamformer is designed according to the constrained constant modulus (CCM) criterion, and the proposed adaptive algorithm operates in the generalized sidelobe canceler (GSC) structure. A detailed study of its operating propert...
متن کاملAdaptive Set-Membership Reduced-Rank Least Squares Beamforming Algorithms
This paper presents a new adaptive algorithm for the linearly constrained minimum variance (LCMV) beamformer design. We incorporate the set-membership filtering (SMF) mechanism into the reduced-rank joint iterative optimization (JIO) scheme to develop a constrained recursive least squares (RLS) based algorithm called JIO-SM-RLS. The proposed algorithm inherits the positive features of reduced-r...
متن کاملAdaptive Reduced-Rank LCMV Beamforming Algorithms Based on Joint Iterative Optimization of Filters: Design and Analysis
This paper presents reduced-rank linearly constrained minimum variance (LCMV) beamforming algorithms based on joint iterative optimization of filters. The proposed reduced-rank scheme is based on a constrained joint iterative optimization of filters according to the minimum variance criterion. The proposed optimization procedure adjusts the parameters of a projection matrix and an adaptive redu...
متن کاملLinearly-constrained line-search algorithm for adaptive filtering
We develop a linearly-constrained line-search adaptive filtering algorithm by incorporating the linear constraints into the least squares problem and searching the solution (filter weights) along the Kalman gain vector. The proposed algorithm performs close to the constrained recursive least squares (CRLS) algorithm while having a computational complexity comparable to the constrained least mea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Integration
دوره 16 شماره
صفحات -
تاریخ انتشار 1993